#if 0

class Solution {
public:
    int halveArray(vector<int>& nums)
    {
        double sum = 0;
        priority_queue<double> heap;

        for (auto e : nums)
        {
            sum += e;
            heap.push(e);
        }

        int count = 0;
        double decrease = sum / 2;
        while (decrease > 0)
        {
            double temp = heap.top();
            temp /= 2;

            heap.pop();
            heap.push(temp);

            decrease -= temp;
            count++;
        }

        return count;
    }
};

#endif